Equitable L(2, 1)-labelings of Sierpiński graphs

Codes and L(2, 1)-labelings in Sierpiński Graphs

The λ-number of a graph G is the minimum value λ such that G admits a labeling with labels from {0, 1, . . . , λ} where vertices at distance two get different labels and adjacent vertices get labels that are at least two apart. Sierpiński graphs S(n, k) generalize the Tower of Hanoi graphs—the graph S(n, 3) is isomorphic to the graph of the Tower of Hanoi with n disks. It is proved that for any...

Constructions of universalized Sierpiński graphs based on labeling manipulations

Sierpiński graphs are known to be graphs with self-similar structures, and their various properties have been investigated until now. Besides, they are known to be isomorphic to WK-recursive networks which have been proposed as interconnection networks because of their nice extendability. As a generalization (resp., variant) of Sierpiński graphs, generalized Sierpiński graphs (resp., extended S...

Vertex Equitable Labelings of Transformed Trees

Constructions of antimagic labelings for some families of regular graphs

In this paper we construct antimagic labelings of the regular complete multipartite graphs and we also extend the construction to some families of regular graphs.

(Di)graph products, labelings and related results

Gallian’s survey shows that there is a big variety of labelings of graphs. By means of (di)graphs products we can establish strong relations among some of them. Moreover, due to the freedom of one of the factors, we can also obtain enumerative results that provide lower bounds on the number of nonisomorphic labelings of a particular type. In this talk, we will focus in three of the (di)graphs p...